- Išsiųsime per 10–14 d.d.
/https://libri-media.knygos-static.lt/0b04cb4c-b9de-4443-af53-bbe3a4ab52e3/1)
- Autorius: Uwe Schöning, Jacobo Torán
- Leidėjas: Lehmanns Media GmbH
- Metai: 2013
- Puslapiai: 184
- ISBN-10: 386541527X
- ISBN-13: 9783865415271
- Formatas: 17,1 x 24,1 x 1,5 cm, minkšti viršeliai
- Kalba: Anglų
- Extra -20 % nuolaida šiai knygai su kodu ENG20
Atsiliepimai
Aprašymas
The satisfiability problem of propositional logic, SAT for short, is the first algorithmic problem that was shown to be NP-complete, and is the cornerstone of virtually all NP-completeness proofs. The SAT problem consists of deciding whether a given Boolean formula has a "solution", in the sense of an assignment to the variables making the entire formula to evaluate to true.
Over the last few years very powerful algorithms have been devised being able to solve SAT problems with hundreds of thousands of variables. For difficult (or randomly generated) formulas these algorithms can be compared to the proverbial search for the needle in a haystack. This book explains how such algorithms work, for example, by exploiting the structure of the SAT problem with an appropriate logical calculus, like resolution. But also algorithms based on "physical" principles are considered.
EXTRA 20 % nuolaida
Kupono kodas: ENG20
Akcija baigiasi už 3d.21:55:20
Nuolaidos kodas galioja perkant nuo 10 €. Nuolaidos nesumuojamos.
- Autorius: Uwe Schöning, Jacobo Torán
- Leidėjas: Lehmanns Media GmbH
- Metai: 2013
- Puslapiai: 184
- ISBN-10: 386541527X
- ISBN-13: 9783865415271
- Formatas: 17,1 x 24,1 x 1,5 cm, minkšti viršeliai
- Kalba: Anglų
The satisfiability problem of propositional logic, SAT for short, is the first algorithmic problem that was shown to be NP-complete, and is the cornerstone of virtually all NP-completeness proofs. The SAT problem consists of deciding whether a given Boolean formula has a "solution", in the sense of an assignment to the variables making the entire formula to evaluate to true.
Over the last few years very powerful algorithms have been devised being able to solve SAT problems with hundreds of thousands of variables. For difficult (or randomly generated) formulas these algorithms can be compared to the proverbial search for the needle in a haystack. This book explains how such algorithms work, for example, by exploiting the structure of the SAT problem with an appropriate logical calculus, like resolution. But also algorithms based on "physical" principles are considered.
Atsiliepimai